Problem structure heuristics and scaling behavior for genetic algorithms

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

genetic algorithms for assembly line balancing problem

there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...

متن کامل

Deletion Mapping of Genetic " Fine Structure ” : Supplementing Ad Hoc Problem Solving Approaches with Algorithms and Heuristics

The transmission of a realistic analysis of the history of biology is exceedingly important in understanding the context of discoveries, and the personal, psychological, sociocultural, and political matrix in which ideas emerge and are propagated. Biology education typically duplicates the historically important process which led to the discovery of the phenomena under consideration. However, a...

متن کامل

Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...

متن کامل

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

متن کامل

Scheduling Problem of Virtual Cellular Manufacturing Systems (VCMS); Using Simulated Annealing and Genetic Algorithm based Heuristics

In this paper, we present a simulated annealing (SA) and a genetic algorithm (GA) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. A virtual manufacturing cell (VMC) is a group of resources that is dedicated to the manufacturing of a part family. Although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Artificial Intelligence

سال: 1996

ISSN: 0004-3702

DOI: 10.1016/0004-3702(95)00058-5